Representation theorem for interlaced q-bilattices
نویسندگان
چکیده
Annotation. It is proved in this work that every interlaced q-bilattice is isomorphic to the superproduct of two q-lattices.
منابع مشابه
A Duality Theory for
Recent studies of the algebraic properties of bilattices have provided insight into their internal structures, and have led to practical results, especially in reducing the computational complexity of bilattice-based multi-valued logic programs. In this paper the representation theorem for interlaced bilattices with negation found in 18] and extended to arbitrary interlaced bilattices without n...
متن کاملProduct representation for default bilattices: an application of natural duality theory
Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model situations in which information is prioritised and so can be viewed hierarchically. These default bilattices are not interlaced: the lattice operations of one...
متن کاملVarieties of Interlaced Bilattices
The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fitting), while others arose from the algebraic study of O. Arieli and A. Avron’s [1] bilattice logics developed in the dissertation [16]. We extend the re...
متن کاملThe product representation theorem for interlaced pre-bilattices: some historical remarks
This note aims to unravel the history of the Product Representation Theorem for Interlaced Pre-bilattices. We will see that it has its lattice-theoretic roots in early attempts to solve one of the problems in Birkhoff’s Lattice Theory. The theorem was presented in its full generality by Czédli, Huhn and Szabó at a conference in Szeged, Hungary in 1980 (and published in 1983). This was several y...
متن کاملAlgebraic semantics of logic programs with negation: Characterization of weak interlaced bilattices
We consider fundamental properties of weak interlaced bilattices and give a characterization theorem of them, that is, for any weak interlaced bilattice W there exists a bounded lattice L such that W can be embedded into a typical weak interlaced bilattice K(L). Hence, any interlaced bilattice can be embedded into the weak interlaced bilattice K(L) for some lattice L.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012